Extending t-designs

A note on extending t-designs

Khosrovshahi and Ajoodani-Namini a new method for extend-"-U"'.) with k t + L Teirlinck sets with the same TUI'!"~.n'lI"t:,pr~ their results to any k a different method. In this paper, we t + 1 and construct a of large sets of dis

Extending Human Interaction and Robot Rescue Designs

The sensors include sonar, cameras, keyboard, the dead reckoning position and a microphone. The drivers for using these sensors, as well as a library for writing behaviors, were provided with the ActivMedia robot. We produced a map of the competition areas in advance using a tape measure. On this map we drew a graph of places that the robot could go from any given place. This map was not only u...

Constructing t-designs from t-wise balanced designs

We give a construction to obtain a t-design from a t-wise balanced design. More precisely, given a positive integer k and a t(v, {k1, k2, . . . , ks}, λ) design D, with with all block-sizes ki occurring in D and 1 ≤ t ≤ k ≤ k1 < k2 < · · · < ks, the construction produces a t-(v, k, nλ) design D∗, with n = lcm( ( k1−t k−t ) , . . . , ( ks−t k−t ) ). We prove that Aut(D) is a subgroup of Aut(D∗),...

New t-designs and large sets of t-designs

Genealogy of t-designs

Abstract Recent years have seen a dramatic increase in existence results for tdesigns with large t, i.e. t ≥ 5. Designs are now known to exist for several thousand parameter sets, mostly constructed by the method of orbiting under a group. This note is a contribution to the classification of these designs by parameters. We take an abstract look at admissible parameter sets in general. We introd...